Normal mode partitioning of Langevin dynamics for biomolecules
نویسندگان
چکیده
منابع مشابه
Normal mode partitioning of Langevin dynamics for biomolecules.
We propose a novel normal mode multiple time stepping Langevin dynamics integrator called NML. The aim is to approximate the kinetics or thermodynamics of a biomolecule by a reduced model based on a normal mode decomposition of the dynamical space. Our basis set uses the eigenvectors of a mass reweighted Hessian matrix calculated with a biomolecular force field. This particular choice has the a...
متن کاملMultiscale Dynamics of Macromolecules Using Normal Mode Langevin
Proteins and other macromolecules have coupled dynamics over multiple time scales (from femtosecond to millisecond and beyond) that make resolving molecular dynamics challenging. We present an approach based on periodically decomposing the dynamics of a macromolecule into slow and fast modes based on a scalable coarse-grained normal mode analysis. A Langevin equation is used to propagate the sl...
متن کاملLangevin dynamics simulations of biomolecules on graphics processors
Due to the very long timescales involved (µs−s), theoretical modeling of fundamental biological processes including folding, misfolding, and mechanical unraveling of biomolecules, under physiologically relevant conditions, is challenging even for distributed computing systems. Graphics Processing Units (GPUs) are emerging as an alternative programming platform to the more traditional CPUs as th...
متن کاملDynamics of Langevin Simulations
This chapter reviews numerical simulations of quantum field theories based on stochastic quantization and the Langevin equation. The topics discussed include renormalization of finite stepsize algorithms, Fourier acceleration, and the relation of the Langevin equation to hybrid stochastic algorithms and hybrid Monte Carlo. Invited chapter to appear in the special supplement “Stochastic Quantiza...
متن کاملConsistency and fluctuations for stochastic gradient Langevin dynamics Consistency and fluctuations for stochastic gradient Langevin dynamics
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally expensive. Both the calculation of the acceptance probability and the creation of informed proposals usually require an iteration through the whole data set. The recently proposed stochastic gradient Langevin dynamics (SGLD) method circumvents this problem by generating proposals which are only ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Chemical Physics
سال: 2008
ISSN: 0021-9606,1089-7690
DOI: 10.1063/1.2883966